Dense critical and vertex-critical graphs
نویسنده
چکیده
This paper gives new constructions of k-chromatic critical graphs with high minimum degree and high edge density, and of vertex-critical graphs with high edge density. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
On the diameter of total domination vertex critical graphs
In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs and independent domination vertex critical graphs and connected domination vertex critical graphs. We provide upper bounds on the diameter of them, two of which are sharp. MSC (2010): 05C12, 05C69
متن کاملOn 4 - γt - Critical Graphs of Order 4 + Δ ( G )
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs total domination critical or just γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We study an open problem of ...
متن کاملRegular vertex diameter critical graphs
A graph is called vertex diameter critical if its diameter increases when any vertex is removed. Regular vertex diameter critical graphs of every valency k ≥ 2 and diameter d ≥ 2 exist, raising the question of identifying the smallest such graphs. We describe an infinite family of k-regular vertex diameter critical graphs of diameter d with at most kd+ (2k − 3) vertices. This improves the previ...
متن کاملA Remark on Total Domination Critical Graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we disprove a conjecture posed in a recent paper(On an open problem concerning total domination critical graphs, Expo. Mat...
متن کاملOn total domination vertex critical graphs of high connectivity
A graph is called γ -critical if the removal of any vertex from the graph decreases the dominationnumber,while a graphwith no isolated vertex isγt -critical if the removal of any vertex that is not adjacent to a vertex of degree 1 decreases the total domination number. A γt -critical graph that has total domination number k, is called k-γt -critical. In this paper, we introduce a class of k-γt ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 258 شماره
صفحات -
تاریخ انتشار 2002